On the Elimination of Hypotheses in Kleene Algebra with Tests

نویسنده

  • Chris Hardin
چکیده

The validity problem for certain universal Horn formulas of Kleene algebra with tests (KAT) can be efficiently reduced to the equational theory. This reduction is known as elimination of hypotheses. Hypotheses are used to describe the interaction of atomic programs and tests and are an essential component of practical program verification with KAT. The ability to eliminate hypotheses of a certain form means that the Horn theory with premises of that form remains decidable in PSPACE. It was known (Cohen 1994, Kozen and Smith 1996, Kozen 1997) how to eliminate hypotheses of the form q = 0. In this paper we show how to eliminate hypotheses of the form cp = c for atomic p. Hypotheses of this form are useful in eliminating redundant code and arise quite often in the verification of compiler optimizations (Kozen and Patron 2000).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypothesis Elimination in Kleene Semirings

—A Kleene Semiring (KS) is an algebraic structure satisfying the axioms of Kleene algebra, minus the annihilation axioms x.0 = 0 = 0.x. We show that, like Kleene algebra (KA), KS admits efficient elimination of various kinds of equational hypotheses, in particular Hoare formulas (x = 0). Our method is purely proof-theoretic, and can be used to eliminate Horn hypotheses in any suitable Horn-equa...

متن کامل

Kleene Algebra with Tests

Kleene algebras with tests provide a rigorous framework for equational speciication and veriication. They have been used successfully in basic safety analysis, source-to-source program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra with tests and *-continuous Kleene algebra with tests over language-theoretic and relational models. W...

متن کامل

Modularizing the Elimination of r=0 in Kleene Algebra

Given a universal Horn formula of Kleene algebra with hypotheses of the form r = 0, it is already known that we can efficiently construct an equation which is valid if and only if the original Horn formula is valid. This is an example of elimination of hypotheses, which is useful because the equational theory of Kleene algebra is decidable while the universal Horn theory is not. We show that hy...

متن کامل

Kleene Algebra with Tests: Completeness and Decidability

Kleene algebras with tests provide a rigorous framework for equational speci cation and veri cation They have been used success fully in basic safety analysis source to source program transformation and concurrency control We prove the completeness of the equational theory of Kleene algebra with tests and continuous Kleene algebra with tests over language theoretic and relational models We also...

متن کامل

Certification of Compiler Optimizations Using Kleene Algebra with Tests

We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation, loop hoisting, induction variable elimination, instruction scheduling, algebraic simplification, loop unrolling, elimination of redundant instructions, array bounds check elimination, and introduction of sentinels. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002